Counting Chromosomes: Not as Easy as 1, 2, 3

نویسندگان

  • Mary Kate Alexander
  • Barbara Panning
چکیده

Mammalian cells must count their X chromosomes to determine whether to initiate X chromosome inactivation. A region that may be important for X chromosome counting has been identified, but the puzzle pieces still do not quite fit.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniqueness of Meromorphic Functions and Differential Polynomials

Let f be a nonconstant meromorphic function defined in the whole complex plane . It is assumed that the reader is familiar with the notations of the Nevanlinna theory such as T r, f , m r, f ,N r, f , and S r, f , that can be found, for instance, in 1–3 . Let f and g be two nonconstant meromorphic functions. Let a be a finite complex number. We say that f and g share the value a CM counting mul...

متن کامل

A Combinatorial Proof of Vandermonde's Determinant

that is as easy as playing cards. Let Vn denote the Vandermonde matrix with (i, j)th entry vi j = x j i (0 ≤ i, j ≤ n). Since the determinant of Vn is a polynomial in x0, x1, . . . , xn , it suffices to prove the identity for positive integers x0, x1, . . . , xn with x0 ≤ x1 ≤ · · · ≤ xn . We define a Vandermonde card to possess a suit and a value, where a card of Suit i has a value from the se...

متن کامل

Counting subgraphs in quasi-random 4-uniform hypergraphs

A bipartite graph G = (V1 ∪ V2, E) is (δ, d)-regular if ̨̨ d− d(V ′ 1 , V ′ 2 ) ̨̨ < δ whenever V ′ i ⊂ Vi, |V ′ i | ≥ δ|Vi|, i = 1, 2.Here, d(V ′ 1 , V ′ 2 ) = e(V ′ 1 , V ′ 2 )/|V ′ 1 ||V ′ 2 | stands for the density of the pair (V ′ 1 , V ′ 2 ). An easy counting argument shows that if G = (V1 ∪ V2 ∪ V3, E) is a 3-partite graph whose restrictions on V1 ∪V2, V1 ∪V3, V2 ∪V3 are (δ, d)regular, then ...

متن کامل

Lecture 25

Given a DNF formula φ with n variables, DNF counting is the problem finding the number of satisfying assignments for φ. Note that in general satisfiability for DNF is easy as we need only satisfy a single clause, but the counting problem is hard. Indeed, if we could do this, then given any 3-CNF formula f with n variables, we could take its negation, count how many satisfying assignments its ne...

متن کامل

Validity of Selected WBC Differentiation Flags in Sysmex XT-1800i

Background: Automatic Cell Counter devises make the CBC differential very easy and delivering the results in few second. However, the problem with this device is facing a flag requires a time-consuming microscopic review of the specimen which causes unacceptable wait times for patient as well as costs for laboratories. In this study, we calculated the validity of WBC d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Current Biology

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2005